Was Moore a Moorean? On Moore and Scepticism

On Moore bipartite digraphs

In the context of the degree/diameter problem for directed graphs, it is known that the number of vertices of a strongly connected bipartite digraph satisfies a Moore-like bound in terms of its diameter k and the maximum out-degrees (d1; d2) of its partite sets of vertices. It has been proved that, when d1d2 > 1, the digraphs attaining such a bound, called Moore bipartite digraphs, only exist w...

On Boyer-Moore Preprocessing

Probably the two best-known exact string matching algorithms are the linear-time algorithm of Knuth, Morris and Pratt (KMP), and the fast on average algorithm of Boyer and Moore (BM). The efficiency of these algorithms is based on using a suitable failure function. When a mismatch occurs in the currently inspected text position, the purpose of a failure function is to tell how many positions th...

ON THE CAPACITY OF EILENBERG-MACLANE AND MOORE SPACES

K. Borsuk in 1979, at the Topological Conference in Moscow, introduced concept of the capacity of a compactum and asked some questions concerning properties of the capacity ofcompacta. In this paper, we give partial positive answers to three of these questions in some cases. In fact, by describing spaces homotopy dominated by Moore and Eilenberg-MacLane spaces, the capacities of a Moore space $...

On Symmetric Moore Geometries

Moore on the Mind

Follow this and additional works at: http://scholarship.law.upenn.edu/faculty_scholarship Part of the Behavior and Behavior Mechanisms Commons, Criminal Law Commons, Criminal Procedure Commons, Law and Philosophy Commons, Law and Psychology Commons, Law Enforcement and Corrections Commons, Medical Jurisprudence Commons, Mental Disorders Commons, Neurosciences Commons, Philosophy of Mind Commons...